Alfonso: Matlab Package for Nonsymmetric Conic Optimization

نویسندگان

چکیده

We present alfonso, an open-source Matlab package for solving conic optimization problems over nonsymmetric convex cones. The implementation is based on the authors’ corrected analysis of a method Skajaa and Ye. It enables any cone as long logarithmically homogeneous self-concordant barrier available or its dual. This includes many cones, example, hyperbolicity cones their duals (such sum-of-squares cones), semidefinite second-order representable power exponential cone. Besides enabling solution that cannot be cast symmetric cone, algorithms also offer performance advantages whose programming representation requires large number auxiliary variables has special structure can exploited in computation. worst-case iteration complexity alfonso best known optimization: [Formula: see text] iterations to reach ?-optimal solution, where ? parameter function used optimization. Alfonso interfaced with (supplied by user) computes Hessian A simplified interface optimize direct product which already been built into software. easily extended include new Both interfaces are illustrated linear programs. oracle efficiency demonstrated using optimal design experiments problem tailored computation greatly decreases time compared state-of-the-art, off-the-shelf Summary Contribution: paper describes particularly important feature this software that, unlike other software, it suitable dual, not limiting user small specific Nonsymmetric such barriers include, Thus, scope far larger than most current does come at price efficiency, our algorithm matches successful interior-point methods via example code significantly outperforms Mosek 9 SCS 2.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SDLS: a Matlab package for solving conic least-squares problems

This document is an introduction to the Matlab package SDLS (Semi-Definite Least-Squares) for solving least-squares problems over convex symmetric cones. The package is shortly presented through the addressed problem, a sketch of the implemented algorithm, the syntax and calling sequences, a simple numerical example and some more advanced features. The implemented method consists in solving the...

متن کامل

A homogeneous interior-point algorithm for nonsymmetric convex conic optimization

A homogeneous infeasible-start interior-point algorithm for solving nonsymmetric convex conic optimization problems is presented. Starting each iteration from the vicinity of the central path, the method steps in the approximate tangent direction and then applies a correction phase to locate the next well-centered primal-dual point. Features of the algorithm include that it makes use only of th...

متن کامل

HOPT – A MATLAB Package for Constrained Optimization in Hardy Spaces

where f̂k = ∫ π −π f(θ)e −ikθ dθ, k ∈ Z, are the Fourier coefficients of f . Further, we assume that g ∈ C(∂D) with g > 0, that K ⊂ ∂D is closed and has positive measure (in practice, K will be an interval or a collection of intervals on ∂D), and that φ ∈ C(K) with |φ| ≤ g on K. Finally, we assume that g, φ and K are symmetric, i.e., φ(e) = φ(e−iθ), g(e) = g(e), and K = K. Under these assumption...

متن کامل

A Primal Barrier Function Phase I Algorithm for Nonsymmetric Conic Optimization Problems

We call a positive semidefinite matrix whose elements are nonnegative a doubly nonnegative matrix, and the set of those matrices the doubly nonnegative cone (DNN cone). The DNN cone is not symmetric but can be represented as the projection of a symmetric cone embedded in a higher dimension. In [16], the authors demonstrated the efficiency of the DNN relaxation using the symmetric cone represent...

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Informs Journal on Computing

سال: 2022

ISSN: ['1091-9856', '1526-5528']

DOI: https://doi.org/10.1287/ijoc.2021.1058